graph algorithm造句

• Solution of the shortcut problem in graph algorithms
  图论中最短路径问题的解法
• Dual graph algorithm for the volume of the city road network
  城市道路网容量的对偶图算法
• Using vb to realize computer ruler and its derived graph algorithm
  实现电脑画尺及其衍生图形算法
• Parallel graph algorithm . university of science and technology of china press , 1991
  此外，本文还介绍了一些典型的并行应用和使能技术。
• The support vector machine composed by least sequence and directed acyclic graph algorithm has been used in paper currency identification , shows the advantages of capability in dealing with scared samples , nonlinear and high dimensions
  将次序最小优化改进算法和有向无环图算法构建的支持向量机用于货币识别，充分发抨了支持向量机解决小样本、非线性和高维模式识别问题的优点。
• The compare is made between the one - versus - one , one - versus - rest and directed acyclic graph algorithm of presented support vector machine multi - class classification algorithms . the simulations show the advantage of directed acyclic graph algorithm over the others the identification rate
  分析比较了现有支持向量机多值分类算法中的一对一、一对多和有向无环图算法，分析表明有向无环图相对于其它两种算法，不仅速度快，而且识别率也较高。
• Topics covered include : sorting ; search trees , heaps , and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing
  课程主题包含了：排序、搜寻树、堆积及杂凑；各个击破法、动态规划、摊提分析、图论演算法、最短路径、网路流量、计算几何、数论演算法；多项式及矩阵的运算；快取及平行计算。
• Topics covered include : sorting ; search trees , heaps , and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing
  课程主题包含了：排序、搜寻树、堆积及散列；各个击破法、动态规划、摊提分析、图论算法、最短路径、网络流量、计算几何、数论算法；多项式及矩阵的运算；高速缓存技术及并行运算。
• Firstly , the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type . secondly , the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm , and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention . finally , the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward , this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically
  首先,采用广度优先搜索算法查找电气原理图中的连通导线端点集,并根据不同类型的继电元件对应的cad图块结构的不同,得到电气原理图中元件接线端子之间的连接关系;其次,根据二分图匹配算法为电气原理图中继电元件选择合适的型号和规格,并采用人工干预和自动布置相结合的方法完成屏面布置图的自动生成;最后,提出了完全无向图中经过每个顶点一次且仅一次的优化路径算法,利用该算法和经过预处理的prim最小生成树算法自动生成屏内安装接线图和端子接线图。
• Topics covered include : randomized computation ; data structures ( hash tables , skip lists ) ; graph algorithms ( minimum spanning trees , shortest paths , minimum cuts ) ; geometric algorithms ( convex hulls , linear programming in fixed or arbitrary dimension ) ; approximate counting ; parallel algorithms ; online algorithms ; derandomization techniques ; and tools for probabilistic analysis of algorithms
  主题包括?随机计算、资料结构（杂凑表、省略串列） 、图论演算法（最小扩张树，最短路径，最少切割） 、几何演算法（凸壳、在固定或任意维度的线性规划) 、近似计数、平行演算法、线上演算法、消去随机技术，以及演算法的机率分析工具。
• Combined with the practical situiation in distribution network , it ' s suitable to select graph algorithm as the theoretical algorithm base . based on structure variable dissipated network theory , this thesis detailedly discusses the transforms of base - to - shape , shape - to - base , vertex - to - arc , arc - to - vertex , over - heated arc dectection , load allotting , load balancing and optimum restoration
  本论文基于变结构耗散网络理论，详细讨论了基形变换、形基变换、点弧变换、弧点变换、过热弧搜寻、负荷分配、负荷均衡化以及优化恢复非故障停电区域供电等一系列与馈线自动化功能相关的处理算法。